我们提供了公式和开源工具，以使用学识渊博的前动力学和设备计算来实现传感器/执行器系统的内部模型预测控制。微控制器单元（MCUS）在与传感器和执行器共关联时计算预测和控制任务的微控制器单元（MCUS）可以实现内部不受束缚的行为。在这种方法中，小型参数大小神经网络模型离线学习前进运动学。我们的开源编译器NN4MC生成代码以将这些预测卸载到MCUS上。然后，牛顿 - 拉夫森求解器实时计算控件输入。我们首先基准在质量 - 弹簧抑制剂模拟上针对PID控制器的这种非线性控制方法。然后，我们在两个具有不同传感，驱动和计算硬件的实验钻机上研究实验结果：具有嵌入式照明传感器的基于肌腱的平台和带有磁性传感器的基于HASEL的平台。实验结果表明，具有较小的内存足迹（小于或等于闪存的6.4％）的参考路径（大于或等于120 Hz）的有效高带宽跟踪。在基于肌腱的平台中，测得的误差之后路径不超过2mm。在基于HASEL的平台中，模拟路径以下误差不超过1mm。这种方法在ARM Cortex-M4F设备中的平均功耗为45.4 MW。这种控制方法还与Tensorflow Lite模型和等效的在设备代码兼容。内物质智能使一类新的复合材料将自主权注入具有精制人工本体感受的结构和系统。
translated by 谷歌翻译
Vehicle routing problems and other combinatorial optimization problems have been approximately solved by reinforcement learning agents with policies based on encoder-decoder models with attention mechanisms. These techniques are of substantial interest but still cannot solve the complex routing problems that arise in a realistic setting which can have many trucks and complex requirements. With the aim of making reinforcement learning a viable technique for supply chain optimization, we develop new extensions to encoder-decoder models for vehicle routing that allow for complex supply chains using classical computing today and quantum computing in the future. We make two major generalizations. First, our model allows for routing problems with multiple trucks. Second, we move away from the simple requirement of having a truck deliver items from nodes to one special depot node, and instead allow for a complex tensor demand structure. We show how our model, even if trained only for a small number of trucks, can be embedded into a large supply chain to yield viable solutions.
translated by 谷歌翻译
Problem instances of a size suitable for practical applications are not likely to be addressed during the noisy intermediate-scale quantum (NISQ) period with (almost) pure quantum algorithms. Hybrid classical-quantum algorithms have potential, however, to achieve good performance on much larger problem instances. We investigate one such hybrid algorithm on a problem of substantial importance: vehicle routing for supply chain logistics with multiple trucks and complex demand structure. We use reinforcement learning with neural networks with embedded quantum circuits. In such neural networks, projecting high-dimensional feature vectors down to smaller vectors is necessary to accommodate restrictions on the number of qubits of NISQ hardware. However, we use a multi-head attention mechanism where, even in classical machine learning, such projections are natural and desirable. We consider data from the truck routing logistics of a company in the automotive sector, and apply our methodology by decomposing into small teams of trucks, and we find results comparable to human truck assignment.
translated by 谷歌翻译
Comparing representations of complex stimuli in neural network layers to human brain representations or behavioral judgments can guide model development. However, even qualitatively distinct neural network models often predict similar representational geometries of typical stimulus sets. We propose a Bayesian experimental design approach to synthesizing stimulus sets for adjudicating among representational models efficiently. We apply our method to discriminate among candidate neural network models of behavioral face dissimilarity judgments. Our results indicate that a neural network trained to invert a 3D-face-model graphics renderer is more human-aligned than the same architecture trained on identification, classification, or autoencoding. Our proposed stimulus synthesis objective is generally applicable to designing experiments to be analyzed by representational similarity analysis for model comparison.
translated by 谷歌翻译
Large language models (LLMs) have been shown to be able to perform new tasks based on a few demonstrations or natural language instructions. While these capabilities have led to widespread adoption, most LLMs are developed by resource-rich organizations and are frequently kept from the public. As a step towards democratizing this powerful technology, we present BLOOM, a 176B-parameter open-access language model designed and built thanks to a collaboration of hundreds of researchers. BLOOM is a decoder-only Transformer language model that was trained on the ROOTS corpus, a dataset comprising hundreds of sources in 46 natural and 13 programming languages (59 in total). We find that BLOOM achieves competitive performance on a wide variety of benchmarks, with stronger results after undergoing multitask prompted finetuning. To facilitate future research and applications using LLMs, we publicly release our models and code under the Responsible AI License.
translated by 谷歌翻译
我们提供了奖励黑客的第一个正式定义，即优化不完美的代理奖励功能的现象，$ \ Mathcal {\ tilde {r}} $，根据真实的奖励功能，$ \ MATHCAL {R} $导致性能差。 。我们说，如果增加预期的代理回报率永远无法减少预期的真实回报，则代理是不可接受的。直觉上，可以通过从奖励功能（使其“较窄”）中留出一些术语或忽略大致等效的结果之间的细粒度区分来创建一个不可接受的代理，但是我们表明情况通常不是这样。一个关键的见解是，奖励的线性性（在州行动访问计数中）使得无法实现的状况非常强烈。特别是，对于所有随机策略的集合，只有在其中一个是恒定的，只有两个奖励函数才能是不可接受的。因此，我们将注意力转移到确定性的政策和有限的随机政策集中，在这些策略中，始终存在非平凡的不可动摇的对，并为简化的存在建立必要和充分的条件，这是一个重要的不被限制的特殊情况。我们的结果揭示了使用奖励函数指定狭窄任务和对齐人类价值的AI系统之间的紧张关系。
translated by 谷歌翻译
我们提出了Zeroeggs，这是一个神经网络框架，用于语音驱动的手势生成，以零拍出样式控制。这意味着即使在训练过程中看不见的运动样式，也只能通过一个简短的运动剪辑来控制样式。我们的模型使用一个变性框架来学习样式嵌入，从而可以通过潜在的空间操纵或样式嵌入方式的混合和缩放来修改样式。我们框架的概率性质进一步使给定输入相同的各种输出的产生，以解决手势运动的随机性质。在一系列实验中，我们首先证明了模型对新的扬声器和样式的灵活性和概括性。然后，在一项用户研究中，我们表明我们的模型在运动，语音适当性和风格刻画方面的自然性，适当性和刻画的表现优于先前的最先进技术。最后，我们释放了包括手指在内的全身手势运动的高质量数据集，语音跨越了19种不同的样式。
translated by 谷歌翻译
非正交多访问（NOMA）是一项有趣的技术，可以根据未来的5G和6G网络的要求实现大规模连通性。尽管纯线性处理已经在NOMA系统中达到了良好的性能，但在某些情况下，非线性处理是必须的，以确保可接受的性能。在本文中，我们提出了一个神经网络体系结构，该架构结合了线性和非线性处理的优势。在图形处理单元（GPU）上的高效实现证明了其实时检测性能。使用实验室环境中的实际测量值，我们显示了方法比常规方法的优越性。
translated by 谷歌翻译
急诊科（EDS）的表现对于任何医疗保健系统都非常重要，因为它们是许多患者的入口处。但是，除其他因素外，患者敏锐度水平和访问患者的相应治疗要求的变异性对决策者构成了重大挑战。平衡患者的等待时间首先是由医生与所有敏锐度水平的总长度相处的，对于维持所有患者的可接受的操作表现至关重要。为了解决这些要求在为患者分配空闲资源时，过去提出了几种方法，包括累积的优先排队（APQ）方法。 APQ方法在系统和敏锐度水平方面将优先评分线性分配给患者。因此，选择决策基于一个简单的系统表示，该表示作为选择功能的输入。本文研究了基于机器学习（ML）的患者选择方法的潜力。它假设对于大量的培训数据，包括多种不同的系统状态，（接近）最佳分配可以通过（启发式）优化器计算出关于所选的性能指标，并旨在模仿此类最佳行为。应用于新情况。因此，它结合了系统的全面状态表示和复杂的非线性选择函数。拟议方法的动机是，高质量的选择决策可能取决于描述ED当前状态的各种因素，而不仅限于等待时间，而这些因素可以由ML模型捕获和利用。结果表明，所提出的方法显着优于大多数评估设置的APQ方法
translated by 谷歌翻译
We introduce Power Bundle Adjustment as an expansion type algorithm for solving large-scale bundle adjustment problems. It is based on the power series expansion of the inverse Schur complement and constitutes a new family of solvers that we call inverse expansion methods. We theoretically justify the use of power series and we prove the convergence of our approach. Using the real-world BAL dataset we show that the proposed solver challenges the state-of-the-art iterative methods and significantly accelerates the solution of the normal equation, even for reaching a very high accuracy. This easy-to-implement solver can also complement a recently presented distributed bundle adjustment framework. We demonstrate that employing the proposed Power Bundle Adjustment as a sub-problem solver significantly improves speed and accuracy of the distributed optimization.
translated by 谷歌翻译